Time Complexity Analysis of the Minimal Siphon Extraction Problem of Petri Nets
نویسندگان
چکیده
Given a Petri net N = (P, T, E), a siphon is a set S of places such that the set of input transitions to S is included in the set of output transitions from S. Concerning extraction of one or more minimal siphons containing a given specified set Q of places, the paper shows several results on polynomial time solvability and NP -completeness, mainly for the case |Q| ≥ 1. key words: Petri nets, minimal siphons, polynomial time solvability, NP -completeness, strongly connectedness
منابع مشابه
Approach for minimal-siphon computation in S4PR
The efficient siphon computation is the key to the development of siphon-based deadlock control strategies with good performance. This work studies the computation of minimal siphons in a class of Petri nets called SPR. Firstly, we propose a function with polynomial complexity to determine whether a resource subset can generate a minimal siphon. Next, using the technique of problem partitioning...
متن کاملAlgorithms for Extracting Minimal Siphons Containing Specified Places in a General Petri Net
Given a Petri net PN = (P, T, E), a siphon is a set S of places such that the set of input transitions to S is included in the set of output transitions from S. Concerning extraction of minimal siphons containing a given specified set Q of places, the paper proposes three algorithms based on the branch-and-bound method for enumerating, if any, all minimal siphons containing Q, as well as for ex...
متن کاملApproches de programmation par contraintes pour l'analyse des propriétés structurelles des réseaux de Petri et application aux réseaux biochimiques
Petri nets are a simple formalism for modelling concurrent computation. This formalism has been proposed as a promising tool to describe and analyse biochemical networks. In this thesis, we explore the structural properties of Petri nets as a mean to provide information about the biochemical system evolution and its dynamics, especially when kinetic data are missing, making simulations impossib...
متن کاملA rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers
This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...
متن کاملFlexible Manufacturing System Design and Optimization using Petri Net-based Elementary Siphons
A computer simulation system, which is based-siphon Petri net for control of concurrent processes of the reusable resources, that is mainly aimed to provide guidelines for control and management engineering of flexible manufacturing systems (FMSs) is presented in this work. We present an important technique for the analysis of siphon Petri net (PN) based on structural analysis, control, and sim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999